Filters








36,429 Hits in 3.9 sec

A finite-state model of human sentence processing

Jihyun Park, Chris Brew
2006 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL - ACL '06  
We do not deny the limitations of finite-state models, but argue that our results show that their usefulness has been underestimated.  ...  of empirical sentence processing data.  ...  The RR ambiguity is often categorized as a syntactic ambiguity, but the results suggest that the ambiguity can be resolved locally and its processing difficulty can be detected by a finite state model.  ... 
doi:10.3115/1220175.1220182 dblp:conf/acl/ParkB06 fatcat:t2ukdgtayjg5ve2kld6yz4wwa4

Page 61 of Computational Linguistics Vol. 26, Issue 1 [page]

2000 Computational Linguistics  
There are essentially three observations that motivate the view that the processing of natural language is finite-state: humans have a finite (small, limited, fixed) amount of memory available for language  ...  The human language user, however, seems to process in linear time; humans understand longer sentences with no noticeable delay.  ... 

Human-Robot Interaction Based on Dialog Management Using Sentence Similarity Comparison Method

Dinda Ayu Permatasari, Hanif Fakhrurroja, Carmadi Machbub
2020 International Journal on Advanced Science, Engineering and Information Technology  
Coefficient and using Finite State Machine (FSM).  ...  The speech recognition process using Google Speech for an average of 2.62 seconds shows a reasonably fast response.  ...  Finite State Machine (FSM) is used to model control and sequence processes in a system with a finite number of states.  ... 
doi:10.18517/ijaseit.10.5.7606 fatcat:4flggjf2qrgnffemxhzwnslgde

Structured abbreviation expansion in context [article]

Kyle Gorman, Christo Kirov, Brian Roark, Richard Sproat
2021 arXiv   pre-print
We generate a large, open-source data set of ad hoc abbreviations. This data is used to study abbreviation strategies and to develop two strong baselines for abbreviation expansion  ...  We consider the task of reversing these abbreviations in context to recover normalized, expanded versions of abbreviated messages.  ...  Finite-state pipeline The finite-state pipeline is defined by two weighted finite state automata.  ... 
arXiv:2110.01140v1 fatcat:y7ob2veb7rf4zje5r6ebmbleiu

Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model

Jakub Szymanik, Marcin Zajenkowski
2010 Cognitive Science  
We examine the verification of simple quantifiers in natural language from a computational model perspective.  ...  Our research improves upon, the hypotheses and explanatory power of recent neuroimaging studies as well as provides evidence for the claim that human linguistic abilities are constrained by computational  ...  Acknowledgments We would like to thank Johan van Benthem, Victor Ferreira, Nina Gierasimczuk, Theo Janssen, Marcin Mostowski, Jonathan Shaheen, and Iris van Rooij for comments on the previous version of  ... 
doi:10.1111/j.1551-6709.2009.01078.x pmid:21564222 fatcat:s4rjbseusjbi3cfhoj3ghgilzi

The Problem of Universal Grammar with Multiple Languages: Arabic, English, Russian as Case Study

Nabeel Imhammed
2016 International Journal of Advanced Computer Science and Applications  
Nevertheless, Chomsky suggested the theory of language acquisition in children instinctively through a universal grammar that represents a universal grammar for all human languages.  ...  In this paper, the criticism will be presented, and the conclusion that the general rule is not compatible with all human languages will be suggested by studying some human languages as a case namely Arabic  ...  Sentence Structure in Arabic ,An Example of verbal sentence Fig. 4 . 4 Sentence Structure in the English Language Fig. 5 . 5 finite-state automaton, multi-lingual Fig. 6. finite-state automaton, English  ... 
doi:10.14569/ijacsa.2016.070431 fatcat:7szn7qe4qrgytbscwugzqzeqhq

A SELF-SYSTEM TO IDENTIFY CONCEPTUAL RELATIONSHIPS IN A TEXT

Anastasia Vavilenkova
2015 Vìsnik Nacìonalʹnogo Avìacìjnogo Unìversitetu  
This analysis compares the creation of thematic progressions and a finite state transition network.  ...  This work demonstrates the disadvantages of the augmented finite state transition network and highlights the advantages of constructing logic and linguistic models of natural language sentences as the  ...  A finite state transition network for it will look like Fig. 4 .  ... 
doi:10.18372/2306-1472.62.7780 fatcat:or4nuzhl4baoti7x4s7w5l64nu

What artificial grammar learning reveals about the neurobiology of syntax

Karl-Magnus Petersson, Vasiliki Folia, Peter Hagoort
2012 Brain and Language  
In this paper we examine the neurobiological correlates of syntax, the processing of structured sequences, by comparing FMRI results on artificial and natural language syntax.  ...  The main findings of this study show that the left inferior frontal region centered on BA 44/45 is active during artificial syntax processing of well-formed (grammatical) sequence independent of local  ...  Acknowledgement We are grateful to Morten Christiansen and Pienie Zwitserlood for their comments on a previous version of this paper.  ... 
doi:10.1016/j.bandl.2010.08.003 pmid:20943261 fatcat:25bpjhw5mjexdgs3hjsn6sus7e

An Associative Cortical Model of Language Understanding and Action Planning [chapter]

Andreas Knoblauch, Heiner Markert, Günther Palm
2005 Lecture Notes in Computer Science  
In this work we describe the implementation of a cell assembly-based model of several visual, language, planning, and motor areas to enable a robot to understand and react to simple spoken commands.  ...  The brain representations of words and their referent actions and objects appear to be strongly coupled neuronal assemblies distributed over several cortical areas.  ...  For example, processing of a sentence "Bot show red plum" would activate the state sequence S→Pp→OA1→O1→ok SPO corresponding to expectation of processing of a subject, a predicate, an object or attribute  ... 
doi:10.1007/11499305_42 fatcat:v5jilkauhjhyzftswsz53r5df4

Page 465 of Proceedings of the American Philosophical Society Vol. 104, Issue 5 [page]

1960 Proceedings of the American Philosophical Society  
Human speech is pro- duced by a finite-state device and by an essentially left-to-right process. There exists a temporary or working memory that can contain about seven items.  ...  The actual process of sentence production corre- sponds in our model to applying rules by suc- This process of applying constituent structure rules, if unrestrained, would lead to sentences requiring than  ... 

Learning finite-state models for machine translation

Francisco Casacuberta, Enrique Vidal
2006 Machine Learning  
Moreover, the relative simplicity of these mappings has recently led to the development of techniques for learning finite-state transducers from a training set of inputoutput sentence pairs of the languages  ...  In formal language theory, finite-state transducers are well-know models for simple "input-output" mappings between two languages.  ...  ) finite-state model, allows for a potentially better approximation.  ... 
doi:10.1007/s10994-006-9612-9 fatcat:2brzvkrv4jg7dhivheufceltya

Learning Finite-State Models for Machine Translation [chapter]

Enrique Vidal, Francisco Casacuberta
2004 Lecture Notes in Computer Science  
Moreover, the relative simplicity of these mappings has recently led to the development of techniques for learning finite-state transducers from a training set of inputoutput sentence pairs of the languages  ...  In formal language theory, finite-state transducers are well-know models for simple "input-output" mappings between two languages.  ...  ) finite-state model, allows for a potentially better approximation.  ... 
doi:10.1007/978-3-540-30195-0_2 fatcat:n2soiu6f5ze2vb66jg5qq3y6qe

Computational and evolutionary aspects of language

Martin A. Nowak, Natalia L. Komarova, Partha Niyogi
2002 Nature  
Subsets of regular languages that are generated by finite-state automata with n states, however, have finite VC dimension, and one can estimate bounds on the number of sample sentences that are needed  ...  'Regular' languages are generated by finite-state grammars, which are equivalent to finite-state automata.  ... 
doi:10.1038/nature00771 pmid:12050656 fatcat:b4ud7exuhbgudocp7wrstizofi

A Novel Approach to Computer-Assisted Translation Based on Finite-State Transducers [chapter]

Jorge Civera, Juan M. Vilar, Elsa Cubel, Antonio L. Lagarda, Sergio Barrachina, Francisco Casacuberta, Enrique Vidal
2006 Lecture Notes in Computer Science  
In this framework, a human translator interacts with a translation system that dynamically offers a list of translations that best completes the part of the sentence already translated.  ...  Stochastic finite-state transducer technology is proposed to support this CAT system. The system was assessed on two real tasks of different complexity in several languages.  ...  Those states that are reached at the end of the parsing process of the source sentence, over the SFST, are considered final states (as well as those states reachable with λ-transitions from them).  ... 
doi:10.1007/11780885_5 fatcat:ghzhtt6z4vgdjmqcvvaeumsyqy

Page 173 of Computational Linguistics Vol. 31, Issue 2 [page]

2005 Computational Linguistics  
If each sentence in this corpus is annotated by a list of transitions of an FA recognizing the sentence or a parse tree for a CFG generating the sentence, then training may consist simply in relative frequency  ...  Language models often consist of a symbolic description of a language, such as a finite automaton (FA) or a context-free grammar (CFG), extended by a probability assignment to, for example, the transitions  ... 
« Previous Showing results 1 — 15 out of 36,429 results