Results 51 to 60 of about 146,311 (198)

Replicating Current Procedural Terminology code assignment of rhinology operative notes using machine learning

open access: yesWorld Journal of Otorhinolaryngology - Head and Neck Surgery, EarlyView.
Abstract Objectives Documentation and billing are important and time‐consuming parts of an otolaryngologist's work. Given advancements in machine learning (ML), we evaluated the ability of ML algorithms to use operative notes to classify rhinology procedures by Current Procedural Terminology (CPT®) code.
Christopher P. Cheng   +6 more
wiley   +1 more source

On the Complexity and Performance of Parsing with Derivatives

open access: yes, 2016
Current algorithms for context-free parsing inflict a trade-off between ease of understanding, ease of implementation, theoretical complexity, and practical performance. No algorithm achieves all of these properties simultaneously. Might et al.
Adams, Michael D.   +2 more
core   +1 more source

Unified Neural Lexical Analysis Via Two‐Stage Span Tagging

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Lexical analysis is a fundamental task in natural language processing, which involves several subtasks, such as word segmentation (WS), part‐of‐speech (POS) tagging, and named entity recognition (NER). Recent works have shown that taking advantage of relatedness between these subtasks can be beneficial.
Yantuan Xian   +5 more
wiley   +1 more source

CPEG [PDF]

open access: yesProceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019
Accepted for publication in the proceedings of the 34th ACM/SIGAPP Symposium On Applied Computing (SAC'19)
Daisuke Yamaguchi, Kimio Kuramitsu
openaire   +3 more sources

Generation of Hypergraphs from the N-Best Parsing of 2D-Probabilistic Context-Free Grammars for Mathematical Expression Recognition

open access: yes2020 25th International Conference on Pattern Recognition (ICPR), 2021
[EN] We consider hypergraphs as a tool obtained with bidimensional Probabilistic Context-Free Grammars to compactly represent the result of the n-best parse trees for an input image that represents a mathematical expression. More specifically, in this paper we propose: i) an algorithm to compute the N-best parse trees from a 2D-PCFGs, ii) an algorithm ...
Noya, Ernesto   +2 more
openaire   +2 more sources

Approximating Procedural Models of 3D Shapes with Neural Networks

open access: yesComputer Graphics Forum, EarlyView.
Abstract Procedural modeling is a popular technique for 3D content creation and offers a number of advantages over alternative techniques for modeling 3D shapes. However, given a procedural model, predicting the procedural parameters of existing data provided in different modalities can be challenging.
Ishtiaque Hossain   +2 more
wiley   +1 more source

More Complex Constrained Language? An Investigation on Nominal Complexity in Constrained Spoken English Varieties of ESL, EFL, and Interpreted English

open access: yesInternational Journal of Applied Linguistics, EarlyView.
ABSTRACT While previous research has established nominal complexity as a key indicator of grammatical complexity, its multi‐dimensional manifestation in constrained varieties remains underexplored. This study investigates the distribution of complex nominal structures in constrained spoken English varieties, specifically English as a Second Language ...
Jiaxin Chen, Yao Yao, Dechao Li
wiley   +1 more source

Multiword Discourse Markers Across Languages: A Linguistic and Computational Perspective

open access: yesInternational Journal of Applied Linguistics, EarlyView.
ABSTRACT Discourse markers (DMs) are linguistic expressions that convey different semantic and pragmatic values, managing and organizing the structure of spoken and written discourses. They can be either single‐word or multiword expressions (MWE), made up of conjunctions, adverbs, and prepositional phrases.
Elena‐Simona Apostol   +9 more
wiley   +1 more source

Pika parsing: reformulating packrat parsing as a dynamic programming algorithm solves the left recursion and error recovery problems [PDF]

open access: yesarXiv, 2020
A recursive descent parser is built from a set of mutually-recursive functions, where each function directly implements one of the nonterminals of a grammar. A packrat parser uses memoization to reduce the time complexity for recursive descent parsing from exponential to linear in the length of the input.
arxiv  

Application-oriented spatial graph grammars [PDF]

open access: yes, 2003
The Reserved Graph Grammar (RGG) is a general graph grammar formalism that expresses a wide range of visual languages. This paper presents an extension to RGG with the capability of spatial specification.
Huang, M, Kong, J, Zhang, K
core  

Home - About - Disclaimer - Privacy