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.
Filters
k-Local Internal Contextual Grammars
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
Also, we propose an efficient algorithmic solution for the membership problem for k-local contextual grammars with polynomial choice. ...
In this paper we propose a generalization of the local internal contextual grammars, introduced by Ilie in 1997, namely the k-local internal contextual grammars. ...
We can now formally define the parsing algorithm for the internal contextual grammar with context free choice G and k-local derivation, following the guidelines stated in Remark 3. ...
doi:10.1007/978-3-642-22600-7_14
fatcat:r3kz3d4uf5adbdyr5nzdgfphha
From Contextual Grammars to Range Concatenation Grammars
2004
Electronical Notes in Theoretical 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 2019; you can also visit the original URL.
The file type is application/pdf.
We show that the languages de ned by s u c h an extension may need an exponential parse time. ...
One reason is certainly the lack of e cient parsers for contextual languages. ...
sensitivity (MCS) (see 7]) is built, can be de ned with internal CGs with regular choice. ...
doi:10.1016/s1571-0661(05)82573-3
fatcat:xgu6ehf7u5ctdgoi56ag4lhhd4
A Breadth-First Parsing Model
1983
International Joint Conference on Artificial Intelligence
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 2022; you can also visit the original URL.
The file type is application/pdf.
Recent attempts at modeling humans' abilities at processing natural language have centered around depth first parsing algorithms, and control strategies for making the best choices for disambiguation and ...
algorithm avoids some of the common pitfalls of depth-first approaches regarding ambiguity, and by using more pre-ccmputed information about the grammar, avoids same of the usual problems of parallel parsing ...
As an alternative to the deterministic parsers that have been proposed, we have suggested a breadth-first parser for context-free languages. ...
dblp:conf/ijcai/Bear83
fatcat:q5gnkev2tngqbnde4lrqoczfh4
Research Report: The Parsley Data Format Definition Language
2020
2020 IEEE Security and Privacy Workshops (SPW)
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 2022; you can also visit the original URL.
The file type is application/pdf.
In contrast to programming languages, grammars for even common data formats such as ELF and PDF are typically context-sensitive and heterogenous. ...
parsers from such grammar specifications can yield correct and type-and memory-safe data parsing routines. ...
Although context-free grammars (CFGs) also use the EBNF notation, there are critical differences in its adaptation for PEGs: (a) the choice combinator in PEGs is ordered, as opposed to non-deterministic ...
doi:10.1109/spw50608.2020.00064
fatcat:htzbbb66lvhb7nya3x4iwgffia
Efficient parsing of spoken inputs for human-robot interaction
2009
RO-MAN 2009 - The 18th IEEE International Symposium on Robot and Human Interactive Communication
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 model incorporates a wide range of linguistic and contextual features and can be trained with a simple perceptron. ...
The approach is based on a word lattice parser combined with a statistical model for parse selection. ...
Weights are automatically assigned to each rule by parsing our corpus, leading to a small stochastic context-free grammar augmented with semantic information. ...
doi:10.1109/roman.2009.5326159
dblp:conf/ro-man/LisonK09
fatcat:uprrqfxh5bccpkguw5mcin7bwm
An xpath-based discourse analysis module for spoken dialogue systems
2004
Alternate track papers & posters of the 13th international conference on World Wide Web - WWW Alt. '04
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 show that, in managing the human-machine interaction, the discourse context and the dialogue history are effectively represented as Document Object Model (DOM) structures. ...
describes an XPath-based discourse analysis module for Spoken Dialogue Systems that allows the dialogue author to easily manipulate and query both the user input's semantic representation and the dialogue context ...
To achieve the classification task, we use an extended version of a boosting-style classification algorithm [2] trained on an application dependent corpus and combined with context-free grammars (CFGs ...
doi:10.1145/1010432.1010564
fatcat:geum6j42s5eo3agdpbji2umoey
An xpath-based discourse analysis module for spoken dialogue systems
2004
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters - WWW Alt. '04
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 show that, in managing the human-machine interaction, the discourse context and the dialogue history are effectively represented as Document Object Model (DOM) structures. ...
describes an XPath-based discourse analysis module for Spoken Dialogue Systems that allows the dialogue author to easily manipulate and query both the user input's semantic representation and the dialogue context ...
To achieve the classification task, we use an extended version of a boosting-style classification algorithm [2] trained on an application dependent corpus and combined with context-free grammars (CFGs ...
doi:10.1145/1013367.1013499
dblp:conf/www/FabbrizioL04
fatcat:r2spuz7mqbbx3luxq4re5k6vfq
On Difficulties of Cross-Lingual Transfer with Order Differences: A Case Study on Dependency Parsing
[article]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Different languages might have different word orders. ...
and perform especially well on distant languages. ...
Contextual Encoders Considering the sequential nature of languages, RNN is a natural choice for the encoder. ...
arXiv:1811.00570v3
fatcat:n47ecgxpxbcitaply4ykgpns4m
A bottom-up efficient algorithm learning substitutable languages from positive examples
2014
International Conference on Grammatical Inference
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 2022; you can also visit the original URL.
The file type is application/pdf.
in our previous study introducing the class of local substitutable languages. ...
by a generalization based on local substitutability. ...
Acknowledgments This work benefited from the support of the French Government run by the National Research Agency and with regards to the investment expenditure programme IDEALG ANR-10-BTBR-04. ...
dblp:conf/icgi/CosteGN14
fatcat:l4hzr7rh5nc2dl6skjfzfkm5vq
Semantic Interoperability through A Novel Cross-Context Tabular Document Representation Approach for Smart Cities
2020
IEEE Access
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.
Semantic interoperability is the process of representing, editing, and transmitting semantic information in one context, and then receiving and interpreting it in another. ...
The current research methods of semantic interoperability generally include standardization, ontology modeling and collaboration templates, each of which has its own internalized limitations. ...
The semantics of rules is also context-free due to the direct inheritance from the IID-based context-free Tabdoc document. ...
doi:10.1109/access.2020.2986485
fatcat:2zpigksm4bfzjehkamzlc4afzm
Natural Language Parsing as Statistical Pattern Recognition
[article]
1994
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Based on distributionally-derived and linguistically-based features of language, this parser acquires a set of statistical decision trees which assign a probability distribution on the space of parse trees ...
Traditional natural language parsers are based on rewrite rule systems developed in an arduous, time-consuming manner by grammarians. ...
In fact, it should be clear that in a problem like parsing, where long-distance lexical information is crucial to disambiguate interpretations accurately, local models like P-CFGs (probabilistic context-free ...
arXiv:cmp-lg/9405009v2
fatcat:2qh6ft7wyndmvfjgzhaiz6qefu
From SPMRL to NMRL: What Did We Learn (and Unlearn) in a Decade of Parsing Morphologically-Rich Languages (MRLs)?
[article]
2020
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 2020; you can also visit the original URL.
The file type is application/pdf.
Languages (MRLs).Here we reflect on parsing MRLs in that decade, highlight the solutions and lessons learned for the architectural, modeling and lexical challenges in the pre-neural era, and argue that ...
It has been exactly a decade since the first establishment of SPMRL, a research initiative unifying multiple research efforts to address the peculiar challenges of Statistical Parsing for Morphologically-Rich ...
the choice of our neural architectural decisions. ...
arXiv:2005.01330v1
fatcat:eztcdvamnjdl3kyuw3xzes5s2u
Incremental analysis of real programming languages
1997
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation - PLDI '97
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 2006; you can also visit the original URL.
The file type is application/pdf.
To create this representation, we have developed an efficient incremental parser for general context-free grammars. ...
Designers of batch compilers work around such limitations by combining generated components with ad hoc techniques (for instance, performing partial type and scope analysis in tandem with parsing). ...
This problem arises whenever the natural context-free syntax depends on non-local type information [28] . ...
doi:10.1145/258915.258920
dblp:conf/pldi/WagnerG97
fatcat:6sdjeqocpjc55f5bskjh4pkiuu
Incremental analysis of real programming languages
1997
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 2006; you can also visit the original URL.
The file type is application/pdf.
To create this representation, we have developed an efficient incremental parser for general context-free grammars. ...
Designers of batch compilers work around such limitations by combining generated components with ad hoc techniques (for instance, performing partial type and scope analysis in tandem with parsing). ...
This problem arises whenever the natural context-free syntax depends on non-local type information [28] . ...
doi:10.1145/258916.258920
fatcat:tk4or7kxrnejjlqqtru6tzsnae
Optimizing Parser Combinators
2016
Proceedings of the 11th edition of the International Workshop on Smalltalk Technologies - IWST'16
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 2016; you can also visit the original URL.
The file type is application/pdf.
Parser combinators follow the structure of an underlying grammar, are modular, well-structured, easy to maintain, and can recognize a large variety of languages including context-sensitive ones. ...
Parser combinators are a popular approach to parsing. ...
also powerful in their expressiveness as they can parse beyond context-free languages (e.g., layout-sensitive languages (Hutton and Meijer 1996; Adams and Agacan 2014) ). ...
doi:10.1145/2991041.2991042
fatcat:tdgyvsvmpnd7tgv2mhwbkin74a
« Previous
Showing results 1 — 15 out of 8,690 results