IntroductionRepeated consultations in primary care represent a significant burden on healthcare services. Characterizing the patients who repeatedly attend ambulatory care would enhance our understanding of the healthcare needs of this population, with a view to providing appropriate services. The aim of this study was therefore to identify the factors associated with repeated consultation in unscheduled care. Our secondary aim was to explore the specific profile of patients aged >65 years.MethodsA retrospective case–control study comparing re-consultation within 30 days at a primary care facility versus non-reconsulting patients, defined as those who did not reconsult within 30 days, among patients consulting over a period of 1 year (1 January to 31 December 2019). Data was collected for a random sample of 5,059 consultations. Patients and controls were matched for age ± 5 years, and sex.ResultsThe main factors associated with repeat consultation were an initial consultation late at night (midnight to 6.00 am; OR 1.31, 95%CI 1.20–1.44), and psychological disorders as the main diagnosis (OR 1.33, 95%CI 1.20–1.48). Conversely, consulting at the weekend was associated with a lower likelihood of repeat consultation (OR 0.82, 95% 0.85–0.91).Conclusion30-day reconsultations were significantly more frequent after late night consultation. This could be used as an indicator of the quality of care to assess performance of general practice teams with implications for improving overall health of an aging population.
Feature structures have been several times considered to enrich categorial grammars in order to build fine-grained grammars. Most attempts to unify both frameworks either model categorial types as feature structures or add feature structures on top of categorial types. We pursue a different approach: using feature structure as categorial atomic types. In this article, we present a procedure to create, from a simplified HPSG grammar, an equivalent abstract categorial grammar (ACG). We represent a feature structure by the enumeration of its totally welltyped upper bounds, so that unification can be simulated as intersection. We implement this idea as a meta-ACG preprocessor 1 .
Translation of Lambek Grammars into Abstract Categorial GrammarsLambek Grammars (LG) are a computational modelling of natural language, based on non-commutative compositional types. It has been widely studied, especially for languages where the syntax plays a major role (like English). The goal of this internship report is to demonstrate that every Lambek Grammar can be, not entirely but efficiently, expressed in Abstract Categorial Grammars (ACG). The latter is a novel modelling based on higher-order signature homomorphisms (using λ-calculus), aiming at uniting the currently used models. The main idea is to transform the type rewriting system of LGs into that of Context-Free Grammars (CFG) by erasing introduction and elimination rules and generating enough axioms so that the cut rule suffices. This iterative approach preserves the derivations and enables us to stop the possible infinite generative process at any step. Although the underlying algorithm was not fully implemented, this proof provides another argument in favour of the relevance of ACGs in Natural Language Processing. Fiche de synthèseLe contexte général J'ai effectué mon stage de L3 dans le domaine de la linguistique informatique, un champ multidisciplinaire de la recherche qui vise à étudier les langues naturelles avec les formalismes informatiques. Plus précisément, le traitement automatique des langues (TAL) cherche à créer des outils de traitement de la langue naturelle écrite ou orale pour diverses applications (recherche d'information, traduction automatique,...). J'étais plus axé sur une approche théorique, ayant pour objectif de produire des modèles appuyés sur la logique (grammaire, syntaxe, sémantique,...). Le but est de trouver un formalisme complet et intéressant en pratique qui permette de rendre compte de la structure (et éventuellement sémantique) d'une phrase.Les grammaires (catégorielles) de Lambek [Lam58], utilisées depuis longtemps, misent sur la syntaxe en modélisant les mots par des fonctions et arguments (ou plutôt leur type respectif). Ce symbolisme intéressant a donné lieu a de nombreuses variations qui s'ajustent mieux aux particularités de la langue naturelle. Cependant, peu de programmes ont été développés pour les simples grammaires de Lambek.Les grammaires catégorielles abstraites (ACG) sont un formalisme créé par mon maître de stage Philippe de Groote [dG01]. Elles ont l'avantage de modéliser la structure sous-jacente d'une phrase (les connections entre les mots) avec le même outil logique que le rendu final (la suite de mots). Dans l'optique de montrer que ce modèle est pertinent, les recherches notamment de l'équipe SEMAGRAMME s'orientent vers le développement d'outils pour les ACG (ACGtk) et la mise en relation de ce formalisme avec ceux déjà existants.La question est donc de savoir s'il est possible d'exprimer, et comment, une grammaire de Lambek en ACG. Cela argumenterait en la faveur de ce dernier modèle pour son utilisation concrète dans des outils de TAL. Grâce aux travaux de Pentus [Pen97], des avancées ont déj...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.