C++ SyntaxTree::AddNode方法代码示例

void LeftBinarize( SyntaxTree &tree, ParentNodes &parents )
{
  for(ParentNodes::const_iterator p = parents.begin(); p != parents.end(); p++) {
    const SplitPoints &point = *p;
    if (point.size() > 3) {
      const vector< SyntaxNode* >& topNodes
      = tree.GetNodes( point[0], point[point.size()-1]-1);
      string topLabel = topNodes[0]->GetLabel();

      for(size_t i=2; i<point.size()-1; i++) {
        // cerr << "LeftBin  " << point[0] << "-" << (point[point.size()-1]-1) << ": " << point[0] << "-" << point[i]-1 << " ^" << topLabel << endl;
        tree.AddNode( point[0], point[i]-1, "^" + topLabel );
      }
    }
  }
}

//.........这里部分代码省略.........
      if (isUnary)
        tag = tag.substr(0,tag.size()-1); // remove "/" at the end

      // find the tag name and contents
      string::size_type endOfName = tag.find_first_of(' ');
      string tagName = tag;
      string tagContent = "";
      if (endOfName != string::npos) {
        tagName = tag.substr(0,endOfName);
        tagContent = tag.substr(endOfName+1);
      }

      // *** process new tag ***

      if (isOpen || isUnary) {
        // put the tag on the tag stack
        OpenedTag openedTag = make_pair( tagName, make_pair( wordPos, tagContent ) );
        tagStack.push_back( openedTag );
        // cerr << "XML TAG " << tagName << " (" << tagContent << ") added to stack, now size " << tagStack.size() << endl;
      }

      // *** process completed tag ***

      if (isClosed || isUnary) {
        // pop last opened tag from stack;
        if (tagStack.size() == 0) {
          cerr << "ERROR: tag " << tagName << " closed, but not opened" << ":" << line << endl;
          return false;
        }
        OpenedTag openedTag = tagStack.back();
        tagStack.pop_back();

        // tag names have to match
        if (openedTag.first != tagName) {
          cerr << "ERROR: tag " << openedTag.first << " closed by tag " << tagName << ": " << line << endl;
          return false;
        }

        // assemble remaining information about tag
        size_t startPos = openedTag.second.first;
        string tagContent = openedTag.second.second;
        size_t endPos = wordPos;

        // span attribute overwrites position
        string span = ParseXmlTagAttribute(tagContent,"span");
        if (! span.empty()) {
          vector<string> ij = Tokenize(span, "-");
          if (ij.size() != 1 && ij.size() != 2) {
            cerr << "ERROR: span attribute must be of the form \"i-j\" or \"i\": " << line << endl;
            return false;
          }
          startPos = atoi(ij[0].c_str());
          if (ij.size() == 1) endPos = startPos + 1;
          else endPos = atoi(ij[1].c_str()) + 1;
        }

        // cerr << "XML TAG " << tagName << " (" << tagContent << ") spanning " << startPos << " to " << (endPos-1) << " complete, commence processing" << endl;

        if (startPos >= endPos) {
          cerr << "ERROR: tag " << tagName << " must span at least one word (" << startPos << "-" << endPos << "): " << line << endl;
          return false;
        }

        string label = ParseXmlTagAttribute(tagContent,"label");
        labelCollection.insert( label );

        string scoreString = ParseXmlTagAttribute(tagContent,"score");
        float score = scoreString == "" ? 0.0f : std::atof(scoreString.c_str());

        // report what we have processed so far
        if (0) {
          cerr << "XML TAG NAME IS: '" << tagName << "'" << endl;
          cerr << "XML TAG LABEL IS: '" << label << "'" << endl;
          cerr << "XML SPAN IS: " << startPos << "-" << (endPos-1) << endl;
        }
        SyntaxNode *node = tree.AddNode( startPos, endPos-1, label );
        node->SetScore(score);
      }
    }
  }
  // we are done. check if there are tags that are still open
  if (tagStack.size() > 0) {
    cerr << "ERROR: some opened tags were never closed: " << line << endl;
    return false;
  }

  // collect top labels
  const vector< SyntaxNode* >& topNodes = tree.GetNodes( 0, wordPos-1 );
  for( vector< SyntaxNode* >::const_iterator node = topNodes.begin(); node != topNodes.end(); node++ ) {
    SyntaxNode *n = *node;
    const string &label = n->GetLabel();
    if (topLabelCollection.find( label ) == topLabelCollection.end())
      topLabelCollection[ label ] = 0;
    topLabelCollection[ label ]++;
  }

  // return de-xml'ed sentence in line
  line = cleanLine;
  return true;
}

void SAMT( SyntaxTree &tree, ParentNodes &parents )
{
	int numWords = tree.GetNumWords();

	SyntaxTree newTree; // to store new nodes

	// look through parents to combine children
	for(ParentNodes::const_iterator p = parents.begin(); p != parents.end(); p++)
	{
		const SplitPoints &point = *p;
		
		// neighboring childen: DET+ADJ
		if (point.size() >= 3) {
			// cerr << "complex parent: ";
			// for(int i=0;i<point.size();i++) cerr << point[i] << " ";
			// cerr << endl;

			for(int i = 0; i+2 < point.size(); i++)
			{
				// cerr << "\tadding " << point[i] << ";" << point[i+1] << ";" << (point[i+2]-1) << ": " << tree.GetNodes(point[i  ],point[i+1]-1)[0]->GetLabel() << "+" << tree.GetNodes(point[i+1],point[i+2]-1)[0]->GetLabel() << endl;
				
				newTree.AddNode( point[i],point[i+2]-1,
												 tree.GetNodes(point[i  ],point[i+1]-1)[0]->GetLabel() 
												 + "+" + 
												 tree.GetNodes(point[i+1],point[i+2]-1)[0]->GetLabel() );
			} 
		}
		if (point.size() >= 4) {
			int ps = point.size();
			string topLabel = tree.GetNodes(point[0],point[ps-1]-1)[0]->GetLabel();

			// cerr << "\tadding " << topLabel + "\\" + tree.GetNodes(point[0],point[1]-1)[0]->GetLabel() << endl;
			newTree.AddNode( point[1],point[ps-1]-1,
											 topLabel 
											 + "\\" +
											 tree.GetNodes(point[0],point[1]-1)[0]->GetLabel() );

			// cerr << "\tadding " << topLabel + "/" + tree.GetNodes(point[ps-2],point[ps-1]-1)[0]->GetLabel() << endl;
			newTree.AddNode( point[0],point[ps-2]-1,
											 topLabel 
											 + "/" +
											 tree.GetNodes(point[ps-2],point[ps-1]-1)[0]->GetLabel() );
		}
	}

	// rules for any bordering constituents...
	for(int size = 2; size < numWords; size++)
	{
		for(int start = 0; start < numWords-size+1; start++)
		{
			int end = start+size-1;
			bool done = false;

			if (tree.HasNode( start,end ) || newTree.HasNode( start,end )
					|| SAMTLevel <= 1)
			{
				continue;
			}

			// if matching two adjacent parse constituents: use ++
	
			for(int mid=start+1; mid<=end && !done; mid++)
			{
				if (tree.HasNode(start,mid-1) && tree.HasNode(mid,end)) {
					// cerr << "\tadding " << tree.GetNodes(start,mid-1)[0]->GetLabel() << "++" << tree.GetNodes(mid,  end  )[0]->GetLabel() << endl;

					newTree.AddNode( start, end, 
													 tree.GetNodes(start,mid-1)[0]->GetLabel() 
													 + "++" + 
													 tree.GetNodes(mid,  end  )[0]->GetLabel() );
					done = true;
				}
			}
			if (done) continue;

			// if matching a constituent A right-minus const. B: use A//B
			for(int postEnd=end+1; postEnd<numWords && !done; postEnd++)
			{
				if (tree.HasNode(start,postEnd) && tree.HasNode(end+1,postEnd))
				{
					newTree.AddNode( start, end, 
													 tree.GetNodes(start,postEnd)[0]->GetLabel() 
													 + "//" + 
													 tree.GetNodes(end+1,postEnd)[0]->GetLabel() );
					done = true;
				}
			}
			if (done) continue;

			// if matching a constituent A left-minus constituent B: use A\\B
			for(int preStart=start-1; preStart>=0; preStart--)
			{
				if (tree.HasNode(preStart,end) && tree.HasNode(preStart,start-1))
				{
					// cerr << "\tadding " << tree.GetNodes(preStart,end    )[0]->GetLabel() << "\\\\" <<tree.GetNodes(preStart,start-1)[0]->GetLabel() << endl;
					newTree.AddNode( start, end, 
													 tree.GetNodes(preStart,end    )[0]->GetLabel() 
													 + "\\\\" + 
													 tree.GetNodes(preStart,start-1)[0]->GetLabel() );
					done = true;
//.........这里部分代码省略.........