Skip to search formSkip to main contentSkip to account menu

Affix grammar over a finite lattice

Known as: AGFL, Affix Grammars over a Finite Lattice 
In linguistics, the affix grammars over a finite lattice (AGFL) formalism is a notation for context-free grammars with finite set-valued features… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Context-free grammarExtended Affix GrammarGNUOutline of natural language processing

Broader (1)

Natural language processing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2007
Review
2007
The Grammar Workbench : A First Step towardsLingware
In this paper we describe the ideas behind the Grammar Workbench (GWB). The GWB is one of a series of tools for the development… 
2006
2006
RussNet as a Semantic Component of the Text Analyser for Russian
In this paper we present a text analysis system developed on the basis of the AGFL grammar and RussNet – a wordnet-like lexicon… 
1997
1997
A description of the modern Green noun phrase using the 'affix grammars over a finite lattice' formalism
This article presents a description of the Modern Greek Noun Phrase (NP) using the 'Affix Grammars over a Finite Lattice… 
1997
1997
IRENA: Information Retrieval Engine based on Natural Language Analysis
The experimental IRENA system was developed to study the improvement of precision and recall in document retrieval systems by… 
1997
1997
Robustness and Efficiency in AGFL
The Condorcet project is an information retrieval project carried out at the Knowledge-Based Systems Group at the University of… 
1996
1996
Paraphrasing as a Technique to Support Object-Oriented Analysis
The goal of the information analysis process is to derive the information grammar which describes the communication language… 
1996
1996
Efficient generation of random sentences
We discuss the random generation of strings using the grammatical formalism AGFL. This formalism consists of context-free… 
1996
1996
Proceedings of the first AGFL Workshop
1995
1995
Handling Structural Ambiguity in a Knowledge-Based Information Retrieval System
This paper presents a strategy to handle syntactic ambiguity in a theoretically motivated fashion following general linguistic… 
Review
1992
Review
1992
A Customized Grammar Workbench
In this paper we describe the ideas behind the Grammar Workbench (GWB). The GWB is one of a series of tools for the development… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)