A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Linearly Ordered Attribute Grammars
2015
Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation - PEPM '15
Preserved Fulltext
As a result, we can compile the main AG of the Utrecht Haskell Compiler without the manual addition of augmenting dependencies. ...
AGs are divided into classes based on the nature of the dependencies between the attributes. ...
I 1 S 1 I 1 S 1 I 1 S 1 I 2 S 2 T 1
Selecting augmenting dependencies The goal of an augmenting dependency is to impose a new dependency between attributes of the same non-terminal, such that the threads ...
doi:10.1145/2678015.2682543
dblp:conf/pepm/BinsbergenBD15
fatcat:dqpebc75yzfe5egat3qs6nlzpu
Semantic grammar
1977
ACM SIGART Bulletin
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Semantic grammar is introduced as a paradigm for crganizing-the knowled4e required to understand and permit efficient phrasing. ...
In an attempt to overcome the lack of natural means of communication between student and computer, this thesis addresses the problem of developing a system which can understand natural language within ...
the distinction between procedural and declarative knowledge. ...
doi:10.1145/1045283.1045290
fatcat:23zzpvcrtzgsdpgenot5x6d3zi
Construction Grammar
[chapter]
2006
Encyclopedia of Language & Linguistics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
A concluding section outlines connections between Construction Grammar and use-based models of grammar, acquisition and sentence processing. ...
but of a discourse-pragmatic opposition between the present perfect and the simple past in English: the present perfect functions to introduce a pasttime interval rather than invoking an already established ...
A schematic mass noun lexical entry ...
doi:10.1016/b0-08-044854-2/02031-9
fatcat:x5pazfcs7rgqrpka7shoqj5i7e
Another kind of modular attribute grammars
[chapter]
1992
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Therefore, a module represents a concrete syntactic or semantic design decision~ The import-and export-interface of a module contains not only attributes of its nonterminals, but also semantic functions ...
The decomposition of attribute grammars into modules is investigated. In our approach the alternative rules of a nonterminal may be separated into different modules. ...
FLR utilizes the generative aspect of attribute grammars. The knowledge of a problem domain is described by special attribute grammar rules. ...
doi:10.1007/3-540-55984-1_5
fatcat:zxi3v6daezethgtvpaqfycaqki
NL Understanding with a Grammar of Constructions
[article]
1995
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
speech generator, and the interfaces between those modules. ...
The system consists of a NL grammar, a parser, an on-line calendar, a domain knowledge base (about dates, times and meetings), an application knowledge base (about the calendar), a speech recognizer, a ...
Such rules are necessary, if the distinction between application and domain knowledge is to be maintained. ...
arXiv:cmp-lg/9501002v1
fatcat:saaipkr5f5axjhhe5ug5nvgvvi
Literal Movement Grammars
[article]
1995
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
LMGs provide a simple and efficient treatment of complex linguistic phenomena such as cross-serial dependencies in German and Dutch---separating the treatment of natural language into a parsing phase closely ...
resembling traditional context-free treatment, and a disambiguation phase which can be carried out using matching, as opposed to full unification employed in most current grammar formalisms of linguistical ...
that have contributed a great deal to its consistency and readability. ...
arXiv:cmp-lg/9502036v1
fatcat:kbvusnfedjhmpglqjetcfaqwbu
Translating grammars to accurate metamodels
2018
Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering - SLE 2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
There is a software language engineering gap between metamodel-based languages and grammar-based languages. ...
We conceived a translation from an EBNF-like syntax to Ecore metamodels that considers the grammars' intricacies. ...
Conclusion We presented a concept for translating EBNF-like grammars into accurate metamodels that employs OCL constraints to specify the implicit cardinalities imposed by grammar rules featuring disjunctions ...
doi:10.1145/3276604.3276605
dblp:conf/sle/ButtingJRW18
fatcat:gb532b6kyzdwhi5illkisvkapu
Parsing Arabic Verbal Sentence Using Grammar Ontology
2021
Journal of Engineering Research and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
By populating the ontology with verbal sentences and adding grammar rules, we form a verbal sentence knowledge base. ...
We have implemented the model and have provided it with a user interface where the user can enter a sentence to be parsed and obtains the parsing results. ...
Recent researches [9] used chartparser methodology depending on Context Free Grammar (CFG) to parse a simple Arabic sentence. ...
doi:10.33976/jert.8.2/2021/3
fatcat:4zvzojpeircingyrtk3u54amyu
Generating parallel multilingual LFG-TAG grammars from a MetaGrammar
2003
Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - ACL '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We introduce a MetaGrammar, which allows us to automatically generate, from a single and compact MetaGrammar hierarchy, parallel Lexical Functional Grammars (LFG) and Tree-Adjoining Grammars (TAG) for ...
French and for English: the grammar writer specifies in compact manner syntactic properties that are potentially framework-, and to some extent language-independent (such as subcategorization, valency ...
Therefore, there is no need to generate usual LFG lexical rules, and the absence of lexical rules has no effect on interfacing the grammars we generate with existing LFG parsers. ...
doi:10.3115/1075096.1075120
dblp:conf/acl/ClementK03
fatcat:xtulqdzt3rcbddzz43xqm7sq6e
Augmented Dependency Grammar
1985
Proceedings of the second conference on European chapter of the Association for Computational Linguistics -
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
The computational model, called Augmented Dependency Grammar (ADG), formulates not only the linguistic dependency structure of sentences but also the semantic dependency structure using the extended deep ...
Fact knowledge base and ADG model clarify the qualitative difference between what we call semantics and logical meaning. ...
The binary (augmented) dependency rule has a structure shown in Fig. 2 . ...
doi:10.3115/976931.976960
fatcat:w6krwzu6gjhjjhvvrw2gepfpoe
Formal Grammars of Early Language
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We describe a set of grammars which account for this child's utterances between the ages 1;8.02 and 2;0.30. ...
Specifically, we focus on a single child learning English and use the CHILDES corpus for actual performance data. ...
Acknowledgements This research was supported by Grant No. 2007241 from the United States-Israel Binational Science Foundation (BSF). ...
doi:10.1007/978-3-642-01748-3_14
fatcat:27p3wytrhrewlgtmvnyt7qa4wi
Automating grammar comparison
2015
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Among the key building blocks of our approach is a novel algorithm for efficiently enumerating and sampling words and parse trees from arbitrary context-free grammars; the algorithm supports polynomial ...
We consider from a practical perspective the problem of checking equivalence of context-free grammars. ...
Such cases will not arise if both the grammars are LL(1) (or LL(k) when the rules are augmented with a lookahead distance of k). ...
doi:10.1145/2814270.2814304
dblp:conf/oopsla/MadhavanMGK15
fatcat:gbgiwqvvkza7nascsaw5644o3q
Automating grammar comparison
2015
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Among the key building blocks of our approach is a novel algorithm for efficiently enumerating and sampling words and parse trees from arbitrary context-free grammars; the algorithm supports polynomial ...
We consider from a practical perspective the problem of checking equivalence of context-free grammars. ...
Such cases will not arise if both the grammars are LL(1) (or LL(k) when the rules are augmented with a lookahead distance of k). ...
doi:10.1145/2858965.2814304
fatcat:rbiz4rui4ve4rpzv2ldqkbrjbe
Ambiguity Management in Grammar Writing
2004
Research on Language and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
When linguistically motivated grammars are implemented on a larger scale and applied to real-life corpora, keeping track of ambiguity sources becomes a difficult task. ...
In this paper we report on various tools in the XLE grammar development platform which can be used for ambiguity management in grammar writing. ...
Acknowledgements We would like to thank the ESSLLI 2000 audience and the reviewers for their detailed comments. A. Frank was at XRCE in Grenoble, and J. ...
doi:10.1023/b:rolc.0000016784.26446.98
fatcat:upt66czsozh3flm6w32ilpkefq
Developing a tractable shape grammar
2015
Environment and Planning, B: Planning and Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The development is for a specific application context, namely, to determine the interior layout of a building given its external features; and the process serves as a general strategy for developing tractable ...
Previously, we examined tractable parametric shape grammars (Yue and Krishnamurti, 2013) , and developed a general paradigm for implementing classes of such grammars (Yue and Krishnamurti, 2014) . ...
Any opinions, findings, conclusions or recommendations presented in this paper are those of the authors and do not necessarily reflect the views of CERL. ...
doi:10.1177/0265813515610673
fatcat:oinuk3a6jzbxpp45tvb4bkxrny
« Previous
Showing results 1 — 15 out of 7,887 results