Loading...
Please wait, while we are loading the content...
Similar Documents
Tokens Parses / Tags Voting Rules
| Content Provider | Semantic Scholar |
|---|---|
| Author | Azer, K. |
| Copyright Year | 1998 |
| Abstract | We describe a nite state transducer implementation of a constraint-based morphological disambigua-tion system in which individual constraint rule vote on matching morphological parses. Voting constraint rules have a number of desirable properties: The outcome of the disambiguation is independent of the order of application of the local contextual constraint rules. Thus the rule developer is relieved from worrying about connicting rule sequencing. The approach can also combine statistically and manually obtained constraints, and incorporate negative constraints that rule out certain patterns. The transducer implementation has a number of desirable properties compared to other nite state tagging and light parsing approaches, implemented with automata intersection. The most important of these is that since constraints do not remove parses there is no risk of an overzealous constraint \killing a sentence" by removing all parses of a token during intersection. After a description of our approach we present preliminary results from tagging the Wall Street Journal Corpus with this approach. With about 400 statistically derived constraints and about 570 manual constraints, we can attain an accuracy of 97.82% on the training corpus and 97.29% on the test corpus. We then describe a nite state implementation of our approach and discuss various related issues. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cs.bilkent.edu.tr/tech-reports/1998/BU-CEIS-9801.ps.gz |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
