Affix grammar over a finite lattice

From HandWiki
Short description: Notation for context-free grammars with finite set-valued features


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. ↑ "Affix Grammars for Natural Languages". Attribute Grammars, Applications and Systems. Lecture Notes in Computer Science. 545. Springer, Berlin, Heidelberg. 4 June 1991. pp. 469–484. doi:10.1007/3-540-54572-7_19. ISBN 978-3-540-54572-9. https://link.springer.com/chapter/10.1007/3-540-54572-7_19. 
  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, https://academic.oup.com/dsh/article-abstract/12/2/119/935675 
  3. ↑ "Final Report about the AGFL/GNU Project". NLnet. January 2002. https://nlnet.nl/project/agfl/200201-finalreport.html. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Affix_grammar_over_a_finite_lattice&oldid=4397654"