Results 71 to 80 of about 6,924 (296)

Sentence Similarity Research Based on Chinese FrameNet and Semantic Dependency Parsing

MATEC Web of Conferences, 2017
According to the problems existing in the similarity comparison of Chinese sentences,this paper proposed a sentence similarity computing method which combined with advantages of Chinese frameNet method and semantic dependency parsing method.This method ...
Li Cheng, Wu Yong, Wang Binjun
doaj   +1 more source

LLM‐Integrated Human–Robot Interaction System for Microrobots

Advanced Robotics Research, EarlyView.
This paper proposes an LLM‐based control framework for guiding microrobots using human natural language. This framework can convert the natural human speech into safe and executable command sets for reliable navigation in complex environments. The experimental results show high accuracy and robustness in task performance, demonstrating the potential of
Bairong Zhu, Amar Salehi, Tingting Yu
wiley   +1 more source

Dependency Parsing as Head Selection [PDF]

Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers, 2017
Conventional graph-based dependency parsers guarantee a tree structure both during training and inference. Instead, we formalize dependency parsing as the problem of independently selecting the head of each word in a sentence. Our model which we call \textsc{DeNSe} (as shorthand for {\bf De}pendency {\bf N}eural {\bf Se}lection) produces a distribution
Zhang, Xingxing, Cheng, Jianpeng, Lapata, Maria; id_orcid 0000-0002-2107-1516   +2 more
openaire   +3 more sources

Evalita\u2709 Parsing Task: comparing dependency parsers and treebanks [PDF]

, 2010
The aim of Evalita Parsing Task is at defining and extending Italian state of the art parsing by encouraging the application of existing models and approaches. As in the Evalita\u2707, the Task is organized around two tracks, i.e.
Montemagni, Simonetta, Bosco, Cristina, Mazzei, Alessandro, Lenci, Alessandro, Dell\u27Orletta, Felice   +4 more
core  

A New Method for Dependent Parsing [PDF]

, 2011
Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify common features that cannot be handled by context-free grammars, such as length fields in data formats and significant indentation in programming languages.
Trevor Jim, Yitzhak Mandelbaum
openaire   +1 more source

Tropomyosin 1 Promotes Platelet Adhesion and Clot Contraction Separate from Its Roles in Developmental Hematopoiesis

Advanced Science, EarlyView.
ABSTRACT Genome‐wide association studies (GWAS) link the Tropomyosin 1 (Tpm1) locus to quantitative blood trait variation, but related mechanisms are unclear. Tpm1 encodes an actin‐binding protein that regulates actin filament diversity, cell adhesion, signaling, and actomyosin contractility.
Po‐Lun Kung, Victor Tsao, Alina D Peshkova, Oscar A. Marcos‐Contreras, Kim Ha, Brian M Dulmovits, Nkemdilim Okoli, Anvi Sinha, Gennadiy Fonar, Rong Qiu, Rolf D Bates, Janelle Yeboah, Carson Shalaby, Tyler Truex, Soomin Jeong, Edna C Hardeman, Peter W Gunning, Vladimir R Muzykantov, Jacob W Myerson, Christopher S Thom   +19 more
wiley   +1 more source

Statistical parsing of morphologically rich languages (SPMRL): what, how and whither [PDF]

, 2010
The term Morphologically Rich Languages (MRLs) refers to languages in which significant information concerning syntactic units and relations is expressed at word-level. There is ample evidence that the application of readily available statistical parsing
Jennifer Foster, Alpage (inria/univ Paris-sorbonne, Kübler, Sandra, Tsarfaty, Reut, Lamia Tounsi, Yoav Goldberg, Reut Tsarfaty, Versley, Yannick, Yannick Versley, Candito, Marie, Tounsi, Lamia, Foster, Jennifer, Rehbein, Ines, Marie Candito, Djame ́ Seddah, Seddah, Djamé, Goldberg, Yoav, Ines Rehbein   +17 more
core  

Dependency parsing with energy-based reinforcement learning [PDF]

, 2009
We present a model which integrates dependency parsing with reinforcement learning based on Markov decision process. At each time step, a transition is picked up to construct the dependency tree in terms of the long-run reward.
Chan, KP, Kwok Ping Chan, Zhang, L, Lidan Zhang   +3 more
core   +1 more source

Statistical bistratal dependency parsing [PDF]

Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing Volume 2 - EMNLP '09, 2009
We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubic-time search algorithm for projective dependency parsing, which is used as the backbone of a beam search procedure.
openaire   +2 more sources

Dependency parsing by belief propagation [PDF]

Proceedings of the Conference on Empirical Methods in Natural Language Processing - EMNLP '08, 2008
We formulate dependency parsing as a graphical model with the novel ingredient of global constraints. We show how to apply loopy belief propagation (BP), a simple and effective tool for approximate learning and inference. As a parsing algorithm, BP is both asymptotically and empirically efficient.
David A. Smith, Jason Eisner
openaire   +2 more sources