| 1 |
On the difficulty of using philosophical theories to develop a semantics: the case of Ajdukiewicz
|
|
|
|
In: The Lvov-Warsaw School and Contemporary Philosophy of Language ; https://hal.archives-ouvertes.fr/hal-03292073 ; Piotr Stalmaszczyk (ed.). The Lvov-Warsaw School and Contemporary Philosophy of Language, Brill editions, In press, Poznań Studies in the Philosophy of the Sciences and the Humanities (2021)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
A Model of Unsupervised Formal Learning for Natural Language
|
|
|
|
Abstract:
236 pages ; Formal language theory has shown that strong notions of learnability do not apply directly to classes of formal language that may include natural languages, regardless of the number of strings presented to the learner. However, research in statistical learning has shown that neural network language models can predict certain linguistic properties when trained on text alone. Unsupervised statistical models that leverage grammar formalisms have not yet achieved the same level of performance, despite advantages in interpretability. I introduce a variably supervised learning algorithms that can directly apply the rules of a number of different grammar formalisms to learn from natural language texts. This algorithm, the Missing Link algorithm, allows for the direct comparison of different grammar formalisms and learning environments. I compare results for Combinatory Categorial Grammars, Tree-Adjoining Grammars, and Relational Grammars with a number of different parameters. These results show that weakly equivalent grammar formalisms, such as CCGs and TAGs, perform differently in unsupervised learning and that directly encoding linguistic features into Relational Grammars can improve performance at specific linguistic tasks, at least in English. I also show that the same algorithm can be used to learn simple a semantics semantics using Abstract Meaning Representations. These results open new lines of research into the exploration of learning models for natural language.
|
|
Keyword:
combinatory categorial grammar; grammar formalisms; semantic parsing; syntactic theory; tree-adjoining grammar; unsupervised learning
|
|
URL: http://dissertations.umi.com/cornellgrad:12154
https://doi.org/10.7298/fj3m-7673
https://hdl.handle.net/1813/103003
|
|
BASE
|
|
Hide details
|
|
|
| 3 |
Unsupervised Formal Grammar Induction with Confidence
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2020)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
Natural Language Semantics and Computability
|
|
|
|
In: ISSN: 0925-8531 ; EISSN: 1572-9583 ; Journal of Logic, Language and Information ; https://hal.inria.fr/hal-01315316 ; Journal of Logic, Language and Information, Springer Verlag, 2019, 28 (2), pp.287-307. ⟨10.1007/s10849-019-09290-7⟩ (2019)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
CCG Supertagging Using Morphological and Dependency Syntax Information
|
|
|
|
In: Proceedings International Conference on Computational Linguistics and Intelligent Text Processing ; International Conference on Computational Linguistics and Intelligent Text Processing ; https://hal.archives-ouvertes.fr/hal-02110790 ; International Conference on Computational Linguistics and Intelligent Text Processing, Apr 2019, La Rochelle, France (2019)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
Recovering Chinese Nonlocal Dependencies with a Generalized Categorial Grammar
|
|
|
|
In: http://rave.ohiolink.edu/etdc/view?acc_num=osu154622673336324 (2019)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Representation and parsing of multiword expressions ... : Current trends ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 10 |
Formal analysis of natural language requirements for the design of cyber-physical systems ; Analyse formelle d'exigences en langue naturelle pour la conception de systèmes cyber-physiques
|
|
|
|
In: TALN 2018 - Conférence sur le Traitement Automatique des Langues Naturelles ; https://hal.inria.fr/hal-01970134 ; TALN 2018 - Conférence sur le Traitement Automatique des Langues Naturelles, May 2018, Rennes, France. pp.1-13 (2018)
|
|
BASE
|
|
Show details
|
|
|
| 11 |
Quantification in Frame Semantics with Binders and Nominals of Hybrid Logic
|
|
|
|
In: ISSN: 2299-856X ; EISSN: 2299-8470 ; Journal of Language Modelling ; https://hal.inria.fr/hal-01417853 ; Journal of Language Modelling, Institute of Computer Science, Polish Academy of Sciences, Poland, 2017, 5 (2), ⟨10.15398/jlm.v5i2.147⟩ (2017)
|
|
BASE
|
|
Show details
|
|
|
| 12 |
A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order
|
|
Morrill, Glyn; Scedrov, Andre; Kuznetsov, Stepan. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017), 2017
|
|
BASE
|
|
Show details
|
|
|
| 13 |
Simple K-star Categorial Dependency Grammars and their Inference
|
|
|
|
In: The 13th International Conference on Grammatical Inference (ICGI) ; https://hal.archives-ouvertes.fr/hal-01363393 ; The 13th International Conference on Grammatical Inference (ICGI), Oct 2016, Delft, Netherlands ; http://icgi2016.tudelft.nl/ (2016)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Algorithms for Identifying Syntactic Errors and Parsing with Graph Structured Output
|
|
|
|
In: Kummerfeld, Jonathan Kay. (2016). Algorithms for Identifying Syntactic Errors and Parsing with Graph Structured Output. UC Berkeley: Computer Science. Retrieved from: http://www.escholarship.org/uc/item/242120m5 (2016)
|
|
BASE
|
|
Show details
|
|
|
| 15 |
Categorial Dependency Grammars with Iterated Sequences
|
|
|
|
In: 9th International Conference, LACL 2016 ; https://hal.archives-ouvertes.fr/hal-01424957 ; 9th International Conference, LACL 2016, Dec 2016, Nancy, France. pp.34-51, ⟨10.1007/978-3-662-53826-5_3⟩ (2016)
|
|
BASE
|
|
Show details
|
|
|
| 16 |
Transition-based combinatory categorial grammar parsing for English and Hindi
|
|
|
|
BASE
|
|
Show details
|
|
|
| 18 |
Linguistically Motivated Combinatory Categorial Grammar Induction
|
|
|
|
BASE
|
|
Show details
|
|
|
|
|
