Affix grammar over a finite lattice

Affix grammars over a finite lattice (AGFL) is a restricted type of affix grammar in which affixes can only assume finite sets of values. It is aimed at natural language processing and other applications in linguistics.[1]

Some applications have been published.[2]

The AGFL project developed AGFL-based technology and made it available under the GNU GPL.[3]

References

  1. ↑ Koster, C. H. A. (4 June 1991). "Affix Grammars for Natural Languages". Attribute Grammars, Applications and Systems. Lecture Notes in Computer Science. Vol. 545. Springer, Berlin, Heidelberg. pp. 469–484. doi:10.1007/3-540-54572-7_19. ISBN 978-3-540-54572-9.
  2. ↑ Triantopoulou, T.G. (June 1997), "A description of the modern Green noun phrase using the 'affix grammars over a finite lattice' formalism", Literary and Linguistic Computing, 12 (2): 119–133, doi:10.1093/llc/12.2.119
  3. ↑ Koster, C. H. A. (January 2002). "Final Report about the AGFL/GNU Project". NLnet.
This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.