Evaluation of a Grammar of French Determiners
| dc.creator | Laporte, Eric | |
| dc.date | 2007-11-21 | |
| dc.date.accessioned | 2026-07-07T08:44:18Z | |
| dc.date.available | 2026-07-07T08:44:18Z | |
| dc.description | Existing syntactic grammars of natural languages, even with a far from complete coverage, are complex objects. Assessments of the quality of parts of such grammars are useful for the validation of their construction. We evaluated the quality of a grammar of French determiners that takes the form of a recursive transition network. The result of the application of this local grammar gives deeper syntactic information than chunking or information available in treebanks. We performed the evaluation by comparison with a corpus independently annotated with information on determiners. We obtained 86% precision and 92% recall on text not tagged for parts of speech. | |
| dc.description | 10 pages | |
| dc.identifier | https://arxiv.org/abs/0711.3457 | |
| dc.identifier | http://arxiv.org/abs/0711.3457 | |
| dc.identifier | Dans Annals of the 27th Congress of the Brazilian Society of Computation - Evaluation of a Grammar of French Determiners, Rio de Janeiro : Brésil (2007) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/142610 | |
| dc.subject | Computation and Language | |
| dc.title | Evaluation of a Grammar of French Determiners | |
| dc.type | text |