Name
Abstract | ||
|---|---|---|
The paper describes a data driven dependency parsing approach which uses clausal information of a sentence to improve the parser performance. The clausal information is added automatically during the parsing process. We demonstrate the experiments on Hindi, a language with relatively rich case marking system and free-word-order. All the experiments are done using a modified version of MSTParser. We did all the experiments on the ICON 2009 parsing contest data. We achieved an improvement of 0.87% and 0.77% in unlabeled attachment and labeled attachment accuracies respectively over the baseline parsing accuracies. |
Year | Venue | Keywords |
|---|---|---|
2010 | HLT-NAACL | improving data,rich case,parsing contest data,unlabeled attachment,parsing process,parser performance,modified version,clausal information,dependency parsing |
Field | DocType | ISBN |
Top-down parsing,Data-driven,S-attributed grammar,Computer science,Bottom-up parsing,Dependency grammar,Natural language processing,Artificial intelligence,Parser combinator,Parsing,Sentence | Conference | 1-932432-65-5 |
Citations | PageRank | References |
10 | 0.86 | 8 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Phani Gadde | 1 | 23 | 2.56 |
| Karan Jindal | 2 | 16 | 1.46 |
| Samar Husain | 3 | 190 | 18.43 |
| Dipti Misra Sharma | 4 | 262 | 45.90 |
| Rajeev Sangal | 5 | 220 | 33.27 |