Named entity recognition (NER) extracts entity spans and assigns them to predefined types. Large language models (LLMs) are increasingly used for NER, but most LLM-based methods still rely on a mainly semantic view, judging whether a candidate span is compatible with an entity type. Although effective, this view can miss entities with weak type semantics, over-accept semantically salient modifiers, and leave little chance to recover spans omitted by early candidate extraction. We argue that entity spans are also traceable in sentence form: local structure and prepositions provide cues about a span’s position and function. We propose SSDA-NER, a Semantic-Structural Dual-path Arbitration framework that combines semantic understanding with structural analysis. Specifically, the Semantic path checks candidate type compatibility, while the Structure path withholds explicit semantic guidance during its first stage and identifies possible mentions through structural analysis. The Arbitration Agent then compares their rationales and confidence scores to adjudicate disagreements. Experiments on nine datasets with three backbone LLMs show that the two views are complementary: the Structure path substantially supplements entities missed by the Semantic path on some datasets, and arbitration outperforms existing multi-agent methods in most evaluated settings. Source code is available at https://github.com/MrHoux/SSDA-NER.